Analysis of Iterated Greedy Heuristic for Vertex Clique Covering
نویسندگان
چکیده
منابع مشابه
An Iterated Heuristic Algorithm for the Set Covering Problem
The set covering problem is a well-known NP-hard combinatorial optimization problem with wide practical applications. This paper introduces a novel heuristic for the uni-cost set covering problem. An iterated approximation algorithm (ITEG) based on this heuristic is developed: in the rst iteration a cover is constructed, and in the next iterations a new cover is built by starting with part of t...
متن کاملAn Iterated Heuristic Algorithm for the Set Covering Problem 32
The set covering problem is a well-known NP-hard combinatorial optimization problem with wide practical applications. This paper introduces a novel heuristic for the uni-cost set covering problem. An iterated approximation algorithm (ITEG) based on this heuristic is developed: in the rst iteration a cover is constructed, and in the next iterations a new cover is built by starting with part of t...
متن کاملAnalysis of Greedy Algorithm for Vertex Covering of Random Graph by Cubes
We study randomly induced subgraphs G of a hypercube. Specifically, we investigate vertex covering of G by cubes. We instantiate a greedy algorithm for this problem from general hypergraph covering algorithm [9], and estimate the length of vertex covering of G. In order to obtain this result, a number of theoretical parameters of randomly induced subgraph G were estimated.
متن کاملGreedy Maximum-Clique Decompositions
A greedy clique decomposition of a graph is obtained by removing maximal cliques from a graph one by one until the graph is empty. We have recently shown that any greedy clique decomposition of a graph of order n has at most-~ cliques. A greedy max-clique decomposition is a particular kind of greedy clique decomposition where maximum cliques are removed, instead of just maximal ones. In this pa...
متن کاملConstruction of Near-Optimal Vertex Clique Covering for Real-World Networks
We propose a method based on combining a constructive and a bounding heuristic to solve the vertex clique covering problem (CCP), where the aim is to partition the vertices of a graph into the smallest number of classes, which induce cliques. Searching for the solution to CCP is highly motivated by analysis of social and other real-world networks, applications in graph mining, as well as by the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computing and Informatics
سال: 2018
ISSN: 2585-8807
DOI: 10.4149/cai_2018_2_385